A lower bound for the integer element distinctness problem
نویسندگان
چکیده
منابع مشابه
A Lower Bound for the Integer Element Distinctiveness Problem
The element distinctness problem is to decide for a given (x,, . . . . x,) E W whether all the xi)s are distinct-i.e., is -yi # I, for all i # j? This is a very basic decision problem easily reducible to many other decision and computation problems, for example, sorting. Thus a lower bound for element distinctness provides lower bounds for other problems. Ben-Or (1983) proved a lower bound of Q...
متن کاملPRAM Lower Bound for Element Distinctness Revisited
This paper considers the problem of element distinctness on CRCW PRAMs with unbounded memory. A complete proof of the optimal lower bound of ? n log n= ? p log(n p log n + 1) steps for n elements problem on p processor COMMON PRAM is presented. This lower bound has been previously correctly stated by Boppana, but his proof was not complete. Its correction requires some additional observations a...
متن کاملAdversary Lower Bound for Element Distinctness
In this note we construct an explicit optimal (negative-weight) adversary matrix for the element distinctness problem, given that the size of the alphabet is sufficiently large.
متن کاملQuantum Adversary Lower Bound for Element Distinctness with Small Range
The ELEMENT DISTINCTNESS problem is to decide whether each character of an input string is unique. The quantum query complexity of ELEMENT DISTINCTNESS is known to be Θ(N2/3); the polynomial method gives a tight lower bound for any input alphabet, while a tight adversary construction was only known for alphabets of size Ω(N2). We construct a tight Ω(N2/3) adversary lower bound for ELEMENT DISTI...
متن کاملA New Lower Bound for Flexible Flow Shop Problem with Unrelated Parallel Machines
Flexible flow shop scheduling problem (FFS) with unrelated parallel machines contains sequencing in flow shop where, at any stage, there exists one or more processors. The objective consists of minimizing the maximum completion time. Because of NP-completeness of FFS problem, it is necessary to use heuristics method to address problems of moderate to large scale problem. Therefore, for assessme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1991
ISSN: 0890-5401
DOI: 10.1016/0890-5401(91)90034-y